3

Collection depots facility location problems in trees

Year:
2009
Language:
english
File:
PDF, 212 KB
english, 2009
10

Fast algorithms for computing the diameter of a finite planar set

Year:
1988
Language:
english
File:
PDF, 792 KB
english, 1988
26

On computing the optimal bridge between two convex polygons

Year:
2001
Language:
english
File:
PDF, 119 KB
english, 2001
27

Characterizing LR-visibility polygons and related problems

Year:
2001
Language:
english
File:
PDF, 282 KB
english, 2001
31

Computing the volume of the union of spheres

Year:
1988
Language:
english
File:
PDF, 433 KB
english, 1988
32

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

Year:
2009
Language:
english
File:
PDF, 502 KB
english, 2009
38

Improved algorithms to network p-center location problems

Year:
2014
Language:
english
File:
PDF, 551 KB
english, 2014
39

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network

Year:
2014
Language:
english
File:
PDF, 738 KB
english, 2014
40

COAP 2012 Best Paper Prize

Year:
2013
Language:
english
File:
PDF, 216 KB
english, 2013
41

The cyclical scheduling problem

Year:
2014
Language:
english
File:
PDF, 747 KB
english, 2014